Important Separators and Parameterized Algorithms
نویسنده
چکیده
The notion of “important separators” and bounding the number of such separators turned out to be a very useful technique in the design of fixed-parameter tractable algorithms for multi(way) cut problems. For example, the recent breakthrough result of Chen et al. [3] on the Directed Feedback Vertex Set problem can be also explained using this notion. In my talk, I will overview combinatorial and algorithmic results that can be obtained by studying such separators.
منابع مشابه
Modeling and Hybrid Pareto Optimization of Cyclone Separators Using Group Method of Data Handling (GMDH) and Particle Swarm Optimization (PSO)
In present study, a three-step multi-objective optimization algorithm of cyclone separators is catered for the design objectives. First, the pressure drop (Dp) and collection efficiency (h) in a set of cyclone separators are numerically evaluated. Secondly, two meta models based on the evolved Group Method of Data Handling (GMDH) type neural networks are regarded to model the Dp and h as the re...
متن کاملCovering Small Independent Sets and Separators with Applications to Parameterized Algorithms
We present two new combinatorial tools for the design of parameterized algorithms. The first is a simple linear time randomized algorithm that given as input a d-degenerate graph G and an integer k, outputs an independent set Y , such that for every independent set X in G of size at most k, the probability that X is a subset of Y is at least (( (d+1)k
متن کاملParameterized Tractability of Multiway Cut with Parity Constraints
In this paper, we study a parity based generalization of the classical MULTIWAY CUT problem. Formally, we study the PARITY MULTIWAY CUT problem, where the input is a graph G, vertex subsets Te and To (T = Te ∪ To) called terminals, a positive integer k and the objective is to test whether there exists a k-sized vertex subset S such that S intersects all odd paths from v ∈ To to T \ {v} and all ...
متن کاملSubmission Track B : exact algorithm for Minimum Fill - In ( aka Chordal Completion )
Our implementation follows the exact algorithm of Fomin et al. [3] which is based on listing the minimal separators, the potential maximal cliques, and then performing dynamic programming based on those structures [1, 2]. The algorithm by Fomin et al. refines the approach of Bouchitté and Todinca on some minor aspects (only considering inclusion-minimal minimal separators, trying only the so-ca...
متن کاملObtaining a Bipartite Graph by Contracting Few Edges
We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph G and an integer k, and the task is to determine whether we can obtain a bipartite graph from G by a sequence of at most k edge contractions. Our main result is an f(k) n time algorithm for Bipartite Contraction. Despite a strong resemblance between B...
متن کامل